more about measures and jacobians of singular random matrices
Authors
abstract
in this work are studied the jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
similar resources
More about measures and Jacobians of singular random matrices
In this work are studied the Jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
full textBertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random
The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...
full textOn the singular values of random matrices
We present an approach that allows one to bound the largest and smallest singular values of an N × n random matrix with iid rows, distributed according to a measure on R that is supported in a relatively small ball and linear functionals are uniformly bounded in Lp for some p > 8, in a quantitative (non-asymptotic) fashion. Among the outcomes of this approach are optimal estimates of 1±c √ n/N ...
full textSingular values of convex functions of matrices
Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$ are nonzero matrices and each $X_{i}$ is positive semidefinite. It is shown that if $f$ is a nonnegative increasing convex function on $left[ 0,infty right) $ satisfying $fleft( 0right) =0 $, then $$2s_{j}left( fleft( fra...
full textMore about Singular Line Graphs of Trees
We study those trees whose line graphs are singular. Besides new proofs of some old results, we offer many new results including the computer search which covers the trees with at most twenty vertices.
full textSingular Control of Optional Random Measures
In this thesis, we study the problem of maximizing certain concave functionals on the space of optional random measures. Such functionals arise in microeconomic theory where their maximization corresponds to finding the optimal consumption plan of some economic agent. As an alternative to the well–known methods of Dynamic Programming, we develop a new approach which allows us to clarify the str...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyجلد ۳۹، شماره ۴، صفحات ۷۷۹-۷۸۸
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023